A Language for Teaching Discrete-event Simulation

Courses which teach discrete-event simulation are based on many different simulation languages. The requirements for a language to support teaching simulation are discussed. In particular, it is recommended that such languages separate into distinct modules those aspects of simulation which are taught as separate topics. Implementation of the separation is discussed. The SEESIM language, developed as a teaching aid, is described, and examples of its use are given. Straightforward use of SEESIM can be learned quickly, yet the language provides facilities for a staged introduction to advanced concepts of simulation.     

SN方法粒子输运计算程序自动建模关键技术问题研究

在充分调研和分析SN方法粒子输运计算程序自动建模方法的基础上，对建模过程中的模型文件格式识别、属性编辑、空腔处理及自动划分离散网格等关键技术问题进行了研究，并提出了合理可行的解决方法。通过对SNAM程序建模部分功能测试，验证了这些方法的正确性和有效性。This paper presents two approaches to enhance the geometry modeling ability of SN particle transport simulation codes and focus on the key issues that lie in the processing from CAD model to SN code geometry model, e.g. CAD file format support, void modeling, mesh generation and model-editing. SNAM （SN Automatic Modeling system） has been developed as an interface code between commercial CAD software and SN particle transport simmulation codes. The testing results have shown that the algorithm and implementation used in SNAM are efficient and capable of all the necessary processing from CAD model to SN geometry model.     

The operational performance of the Yale ESTU

The ESTU began operation in 1988 and achieved the design voltage of 20 MV in 1990. Since that time, improvements to the gas handling system, negative ion injector, accelerator terminal and control system have greatly increased its capability and reliability. Today, the ESTU can efficiently produce an extensive assortment of stable ions at wide-ranging energies in support of low-energy nuclear physics.     

变系数非线性方程的Jacobi椭圆函数展开解

把Jacobi椭圆函数展开法扩展并应用到求解变系数的非线性演化方程,比较方便地得到新的解析解 关键词： Jacobi椭圆函数 变系数非线性方程 类椭圆余弦波解 类孤子解     

Application of pressure sensitive paint measurement to a low-solidity cascade diffuser of a transonic centrifugal compressor

A pressure sensitive paint (PSP) measurement has been known as a pressure field measurement technique based on the oxygen quenching phenomenon of luminescence of specific luminophores. A PSP measurement was applied for pressure field measurement in a low-solidity circular cascade diffuser of a single-stage transonic centrifugal compressor with 5 in pressure ratio for HFC134a gas. The oxygen concentration was about 500 ppm. Ru (bath-phen) was adsorbed on a silica-gel thinlayer chromatography sheet, and the sheet was pasted onto the side-wall between the cascade vanes. A drastic change in luminescent intensity was recognized during a surge condition. Also the pressure variations based on luminescent intensity agreed well with the pressure fluctuations measured using a semiconductor pressure sensor with high-frequency-response. It was shown that a PSP measurement worked well to investigate the unsteady pressure fields in a circular cascade diffuser of a transonic centrifugal compressor. Moreover, the time response of PSP becomes clear as a problem to be overcome for the present.     

On bent functions with some symmetric properties

This paper discusses a kind of bent functions that have some symmetric properties about some variables. Section 2 mainly discusses the bent functions symmetric about some two variables and gives the necessary and sufficient condition for these functions. Section 3 gives algebraic expressions of some bent functions.     

2,7-二氯荧光素与蛋白质相互作用的分光光度法研究

首次采用分光光度法研究了模拟生理条件(pH 7.4 Tris-HCl缓冲溶液,离子强度I=0.1)下2,7-二氯荧光素与牛血清白蛋白(BSA)相互作用的情况.研究结果表明:两者相互作用形成稳定的复合物,最大吸收波长为509nm,与2,7-二氯荧光素的最大吸收波长502nm比较,红移了7nm;两者之间主要通过静电引力结合,但并不排除疏水作用力和氢键;两者之间的结合数为32.     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.     

A note on minimum degree conditions for supereulerian graphs

A graph is called supereulerian if it has a spanning closed trail. Let G be a 2-edge-connected graph of order n such that each minimal edge cut SE(G) with |S|3 satisfies the property that each component of G−S has order at least (n−2)/5. We prove that either G is supereulerian or G belongs to one of two classes of exceptional graphs. Our results slightly improve earlier results of Catlin and Li. Furthermore, our main result implies the following strengthening of a theorem of Lai within the class of graphs with minimum degree δ4: If G is a 2-edge-connected graph of order n with δ(G)4 such that for every edge xyE(G) , we have max{d(x),d(y)}(n−2)/5−1, then either G is supereulerian or G belongs to one of two classes of exceptional graphs. We show that the condition δ(G)4 cannot be relaxed.